Random Regular Graph and Generalized De Bruijn Graph with $k$ -Shortest Path Routing
نویسندگان
چکیده
منابع مشابه
Fault Free Shortest Path Routing on the de Bruijn Networks
It is shown that the de Bruijn graph (dBG) can be used as an architecture for interconnection networks and a suitable structure for parallel computation. Recent works have classified dBG based routing algorithms into shortest path routing and fault tolerant routing but investigation into shortest path in failure mode in dBG has been nonexistent. In addition, as the size of the network increase,...
متن کاملDe Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences
This paper presents a method to find new de Bruijn cycles based on ones of lesser order. This is done by mapping a de Bruijn cycle to several vertex disjoint cycles in a de Bruijn digraph of higher order and connecting these cycles into one full cycle. We characterize homomorphisms between de Bruijn digraphs of different orders that allow this construction. These maps generalize the well-known ...
متن کاملShortest path routing and fault-tolerant routing on de Bruijn networks
In this paper, we study the routing problem for the undirected binary de Bruijn interconnection network. Researchers have never proposed a shortest path routing algorithm on the undirected binary de Bruijn network. We first propose a shortest path routing algorithm, whose time complexity in the binary de Bruijn network of 2 nodes is O(m2). Then, based on our shortest path routing algorithm, we ...
متن کاملSparseAssembler: de novo Assembly with the Sparse de Bruijn Graph
de Bruijn graph-based algorithms are one of the two most widely used approaches for de novo genome assembly. A major limitation of this approach is the large computational memory space requirement to construct the de Bruijn graph, which scales with k-mer length and total diversity (N) of unique k-mers in the genome expressed in base pairs or roughly (2k+8)N bits. This limitation is particularly...
متن کاملMemory Efficient De Bruijn Graph Construction
Massively parallel DNA sequencing technologies are revolutionizing genomics research. Billions of short reads generated at low costs can be assembled for reconstructing the whole genomes. Unfortunately, the large memory footprint of the existing de novo assembly algorithms makes it challenging to get the assembly done for higher eukaryotes like mammals. In this work, we investigate the memory i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2018
ISSN: 1045-9219,1558-2183,2161-9883
DOI: 10.1109/tpds.2017.2741492